On the Chvátal rank of linear relaxations of the stable set polytope
نویسندگان
چکیده
Abstract. We study the Chvátal-rank of two linear relaxations of the stable set polytope, the edge constraint and the clique constraint stable set polytope. For some classes of graphs whose stable set polytope is given by 0/1-valued constraints only, we present either the exact value of the Chvátal-rank or upper bounds (of the order of their largest cliques and stable sets) which improve the bounds previously known from the literature (of the order of the graph itself).
منابع مشابه
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
Gomory’s and Chvátal’s cutting-plane procedure proves recursively the validity of linear inequalities for the integer hull of a given polyhedron. The number of rounds needed to obtain all valid inequalities is known as the Chvátal rank of the polyhedron. It is well-known that the Chvátal rank can be arbitrarily large, even if the polyhedron is bounded, if it is of dimension 2, and if its intege...
متن کاملA note on the Chvátal-rank of clique family inequalities
Clique family inequalities a ∑ v∈W xv + (a − 1) ∑ v∈W ′ xv ≤ aδ form an intriguing class of valid inequalities for the stable set polytopes of all graphs. We prove firstly that their Chvátal-rank is at most a, which provides an alternative proof for the validity of clique family inequalities, involving only standard rounding arguments. Secondly, we strengthen the upper bound further and discuss...
متن کاملHandelman's hierarchy for the maximum stable set problem
The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of linear programming relaxations for this problem, based on a result of Handelman showing that a positive polynomial over a polytope can be represented as conic co...
متن کاملOn the Rational Polytopes with Chvátal Rank 1
In this paper, we study the following problem: given a polytope P with Chvátal rank 1, does P contain an integer point? Boyd and Pulleyblank observed that this problem is in the complexity class NP ∩ co-NP, an indication that it is probably not NP-complete. We solve this problem in polynomial time for polytopes arising from the satisfiability problem of a given formula with at least three liter...
متن کاملWeighted graphs defining facets: A connection between stable set and linear ordering polytopes
A graph is α-critical if its stability number increases whenever an edge is removed from its edge set. The class of α-critical graphs has several nice structural properties, most of them related to their defect which is the number of vertices minus two times the stability number. In particular, a remarkable result of Lovász (1978) is the finite basis theorem for α-critical graphs of a fixed def...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITOR
دوره 17 شماره
صفحات -
تاریخ انتشار 2010